#include<bits/stdc++.h>
#define ll long long
#define L(x) xd[x].l
#define R(x) xd[x].r
#define mid (l+r>>1)
#define lc(x) L(x),l,mid
#define rc(x) R(x),mid+1,r
#define OK Ll<=l&&r<=Rr
#define Root 1,1,n
#define rep(x,y,z) for(int x=(y);x<=(z);x++)
#define per(x,y,z) for(int x=(y);x>=(z);x--)
#define repn(x) rep(x,1,n)
#define repm(x) rep(x,1,m)
#define pb push_back
#define e(x) for(int i=h[x],y=to[i];i;i=nxt[i],y=to[i])
#define E(x) for(auto y:p[x])
#define Pi pair<int,int>
#define ui unsigned ll
inline int read(){int s=0,w=1;char c=getchar();while(c<48||c>57) {if(c=='-') w=-1;c=getchar();}while(c>=48&&c<=57)s=(s<<1)+(s<<3)+c-48,c=getchar();return s*w;}
inline void pf(ll x){if(x<0) putchar('-'),x=-x;if(x>9)pf(x/10);putchar(x%10+48);}
using namespace std;
const int N =1e5+5,M=3e6+5,inf=(1LL<<30)-1;
const ll llf=1e18;
int mod;
inline void add(int &a,int b){((a+=b)>=mod) and (a-=mod);}
inline int Add(int a,int b){return add(a,b),a;}
inline int mul(int a,int b){return 1LL*a*b%mod;}
inline void Mul(int &a,int b){a=mul(a,b);}
inline void red(int &a,int b){add(a,mod-b);}
inline int Red(int a,int b){return red(a,b),a;}
inline int qp(int a,int b){if(!b)return 1;int c=qp(a,b>>1);Mul(c,c);if(b&1)Mul(c,a);return c;}
inline int INV(int x){return qp(x,mod-2);}
int n,m,a[N];
inline bool check(int l,int r,int A,int B){
	rep(i,l,r)if(a[r-(i-l)]!=Add(mul(A,a[i]),B))return 0;
	return 1;
}
int f[105][105];
inline void subtask0(){
	rep(i,0,mod-1)rep(j,0,mod-1){
		repn(l)rep(r,l,n)f[i][j]+=check(l,r,i,j);
	} 
	repm(o){
		int op=read(),x=read(),ans=0;
		if(op==1)rep(i,0,mod-1)ans+=f[x][i];
		else rep(i,0,mod-1)ans+=f[i][x];
		cout <<ans<<'\n';
	} 
}
inline void Main(){
	n=read(),m=read(),mod=read();
	repn(i)a[i]=read();
	if(n<=100&&m<=100&&mod<=100){
		subtask0();
		return;
	}
	repm(i){
		int op=read(),x=read();
		if(op==1)cout <<(x==1)*n<<'\n';
		else cout <<(x==0)*n<<'\n';
	} 
}
signed main(){
	freopen("string.in","r",stdin);
	freopen("string.out","w",stdout);
	int T=1;
	while(T--)Main();
	return 0;
}
